#pragma once
#include"RBTree.h"

namespace zyb
{
	template<typename K, typename T>
	class map
	{
	public:
		struct MapKeyOfT
		{
			const K& operator()(const pair<const K, T>& kv)
			{
				return kv.first;
			}
		};
		typedef typename RBTree<K, pair<const K, T>, MapKeyOfT>::iterator iterator;
		typedef typename RBTree<K, pair<const K, T>, MapKeyOfT>::const_iterator const_iterator;
		iterator begin()
		{
			return _t.begin();
		}
		iterator end()
		{
			return _t.end();
		}
		const_iterator begin() const
		{
			return _t.begin();
		}
		const_iterator end() const
		{
			return _t.end();
		}
		T& operator[](const K& key)
		{
			pair<iterator, bool> ret = insert(make_pair(key, T()));
			return ret.first->second;
		}
		pair<iterator, bool> insert(const pair<const K, T>& kv)
		{
			return _t.Insert(kv);
		}
	private:
		RBTree<K, pair<const K, T>, MapKeyOfT> _t;
	};
}